MULTI-ROBOT MOTION PLANNING: A MODIFIED RECEDING HORIZON APPROACH FOR REACHING GOAL STATES

Planning multi-goal tours for robot arms

Multi-Robot Motion Planning

We present a simple and natural extension of the multi-robot motion planning problem where the robots are partitioned into groups (colors), such that in each group the robots are interchangeable. Every robot is no longer required to move to a specific target, but rather to some target placement that is assigned to its group. We call this problem k-color multi-robot motion planning and provide a...

: A Software Toolbox for Receding Horizon Temporal Logic Planning

This paper describes TuLiP, a Python-based software toolbox for the synthesis of embedded control software that is provably correct with respect to an expressive subset of linear temporal logic (LTL) specifications. TuLiP combines routines for (1) finite state abstraction of control systems, (2) digital design synthesis from LTL specifications, and (3) receding horizon planning. The underlying ...

The obstacle avoidance motion planning problem for autonomous vehicles: A low-demanding receding horizon control scheme

The paper addresses the obstacle avoidance motion planning problem for ground vehicles operating in uncertain environments. By resorting to set-theoretic ideas, a receding horizon control algorithm is proposed for robots modelled by linear time-invariant (LTI) systems subject to input and state constraints and disturbance effects. Sequences of inner ellipsoidal approximations of the exact one-s...

Markov Games: Receding Horizon Approach

We consider a receding horizon approach as an approximate solution to two-person zero-sum Markov games with infinite horizon discounted cost and average cost criteria. We first present error bounds from the optimal equilibrium value of the game when both players take correlated equilibrium receding horizon policies that are based on exact or approximate solutions of receding finite horizon subg...